Non-Referenced Prefetch(NRP) Cache for Instruction Prefetching

نویسندگان

  • Gi-Ho Park
  • Oh-Young Kwon
  • Tack-Don Han
  • Shin-Dug Kim
چکیده

A new conceptual cache, NRP (Non-Referenced Prefetch) cache, is proposed to improve the performance of instruction prefetch mechanisms which try to prefetch both the sequential and non-sequential blocks under the limited memory bandwidth. The NRP cache is used in storing prefetched blocks which were not referenced by the CPU, while these blocks were discarded in other previous prefetch mechanisms. By storing the non-referenced prefetch blocks in the NRP cache, both cache misses and memory traacs are reduced. A prefetch method to prefetch both the sequential and the non-sequential instruction paths is designed to utilize the eeectiveness of the NRP cache. The results from trace-driven simulation show that this approach provides an improvement in memory access time than other prefetch methods. Particularly, the NRP cache is more eeective in a lookahead prefetch mechanism that can hide longer memory latency. Also, the NRP cache reduces 50% 112% of the additional memory traacs required to prefetch both instruction paths. This approach can achieve both the improved memory access time and the reduced memory traac as a cost-eeective cache design.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Compiler-Assisted Data Prefetch Controller

Data-intensive applications often exhibit memory referencing patterns with little data reuse, resulting in poor cache utilization and run-times that can be dominated by memory delays. Data prefetching has been proposed as a means of hiding the memory access latencies of data referencing patterns that defeat caching strategies. Prefetching techniques that either use special cache logic to issue ...

متن کامل

A Performance Study of Instruction Cache Prefetching Methods

Prefetching methods for instruction caches are studied via trace-driven simulation. The two primary methods are “fallthrough” prefetch (sometimes referred to as “one block lookahead”) and “target” prefetch. Fall-through prefetches are for sequential line accesses, and a key parameter is the distance from the end of the current line where the prefetch for the next line is initiated. Target prefe...

متن کامل

Threaded prefetching: An adaptive instruction prefetch mechanism

We propose and analyze an adaptive instruction prefetch scheme, called threaded prefetching, that makes use of history information to guide the prefetching. The scheme is based on the observation that control ow paths are likely to repeat themselves. In the proposed scheme, we associate with each instruction block a number of threads that indicate the instruction blocks that have been brought i...

متن کامل

A Combined Hardware/Software Solution for Stream Prefetching in Multimedia Applications

Prefetch techniques may, in general, be applied to reduce the miss rate of a processor’s data cache and thereby improve the overall performance of the processor. More in particular, stream prefetch techniques can be applied to prefetch data streams that are often encountered in multimedia applications. Stream prefetch techniques exploit the fact that data from such streams are often accessed in...

متن کامل

Instruction cache prefetching directed by branch prediction - Computers and Digital Techniques, IEE Proceedings-

As the gap between processor speed and memory speed grow, so the performance penalty of instruction cache misses gets higher. Instruction cache prefetching is a technique to reduce this penalty. The prefetching methods determine the target line to be prefetched generally based on the current fetched line address. However, as the cache line becomes wider, it may contain multiple branches. This i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996